Shallow, deep and very deep cuts in the analytic center cutting plane method
نویسندگان
چکیده
The analytic center cutting plane (ACCPM) methods aims to solve nondiieren-tiable convex problems. The technique consists of building an increasingly reened polyhedral approximation of the solution set. The linear inequalities that deene the approximation are generated by an oracle as hyperplanes separating a query point from the solution set. In ACCPM, the query point is the analytic center, or an approximation of it, for the current polyhedral relaxation. A primal projective algorithm is used to recover feasibility and then centrality. In this paper we show that the cut does not need to go through the query point: it can be deep or shallow. The primal framework leads to a simple analysis of the potential variation, which shows that the inequality needed for convergence of the algorithm is in fact attained at the rst iterate of the feasibility step.
منابع مشابه
Convex Nondifferentiable Optimization: a Survey Focussed on the Analytic Center Cutting Plane Method
We present a survey of nondiierentiable optimization problems and methods with special focus on the analytic center cutting plane method. We propose a self-contained convergence analysis, that uses the formalism of the theory of self-concordant functions, but for the main results, we give direct proofs based on the properties of the logarithmic function. We also provide an in depth analysis of ...
متن کاملConvex nondifferentiable optimization: A survey focused on the analytic center cutting plane method
We present a survey of nondifferentiable optimization problems and methods with special focus on the analytic center cutting plane method. We propose a self-contained convergence analysis, that uses the formalism of the theory of self-concordant functions, but for the main results, we give direct proofs based on the properties of the logarithmic function. We also provide an in depth analysis of...
متن کاملMultiple Cuts in the Analytic Center Cutting Plane Method
We analyze the multiple cut generation scheme in the analytic center cutting plane method. We propose an optimal primal and dual updating direction when the cuts are central. The direction is optimal in the sense that it maximizes the product of the new dual slacks and of the new primal variables within the trust regions defined by Dikin’s primal and dual ellipsoids. The new primal and dual dir...
متن کاملThe Analytic Center Cutting Plane Method with Semidefinite Cuts
We analyze an analytic center cutting plane algorithm for the convex feasibility problems with semideenite cuts. At each iteration the oracle returns a p-dimensional semideenite cut at an approximate analytic center of the set of localization. The set of localization, which contains the solution set, is a compact set consists of piecewise algebraic surfaces. We prove that the analytic center is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Program.
دوره 84 شماره
صفحات -
تاریخ انتشار 1999